Counting with Irrational Tiles
نویسندگان
چکیده
We introduce and study the number of tilings of unit height rectangles with irrational tiles. We prove that the class of sequences of these numbers coincides with the class of diagonals of N-rational generating functions and a class of certain binomial multisums. We then give asymptotic applications and establish connections to hypergeometric functions and Catalan numbers.
منابع مشابه
Two computational primitives for algorithmic self-assembly: copying and counting.
Copying and counting are useful primitive operations for computation and construction. We have made DNA crystals that copy and crystals that count as they grow. For counting, 16 oligonucleotides assemble into four DNA Wang tiles that subsequently crystallize on a polymeric nucleating scaffold strand, arranging themselves in a binary counting pattern that could serve as a template for a molecula...
متن کاملThe Complexity of Rummikub Problems
Rummikub is a tile-based game in which each player starts with a hand of 14 tiles. A tile has a value and a suit. The players form sets consisting of tiles with the same suit and consecutive values (runs) or tiles with the same value and different suits (groups). The corresponding optimization problem is, given a hand of tiles, to form valid sets such that the score (sum of tile values) is maxi...
متن کاملTwo Computational Primitives for Algorithmic Self-Assembly: Copying and Counting Supporting Information
1 Methods Estimated bound on effective error rates: Given an assembly of tiles on a scaffold of N repeat units in which each tile has a mismatch with its lower or right neighbor with independent probability = 1−p, we would like to bound the probability that the assembly contains a particular pattern of M tiles that has been observed. In particular, we are interested in the probability of seeing...
متن کاملRandom Approaches to Fibonacci Identities
Many combinatorialists live by Mach’s words, and take it as a personal challenge. For example, nearly all of the Fibonacci identities in [5] and [6] have been explained by counting arguments [1, 2, 3]. Among the holdouts are those involving infinite sums and irrational quantities. However, by adopting a probabilistic viewpoint, many of the remaining identities can be explained combinatorially. ...
متن کاملRibbon Tile Invariants
Let T be a finite set of tiles, and B a set of regions Γ tileable by T. We introduce a tile counting group G(T,B) as a group of all linear relations for the number of times each tile τ ∈ T can occur in a tiling of a region Γ ∈ B. We compute the tile counting group for a large set of ribbon tiles, also known as rim hooks, in a context of representation theory of the symmetric group. The tile cou...
متن کامل